Experimental Analysis of the ComputationalCost of Evaluating Quanti ed Boolean
نویسندگان
چکیده
Although Knowledge Representation is full of reasoning problems that have been formally proved to be both NP-hard and coNP-hard, the experimental analysis has largely focused on problems belonging to either NP or coNP. We still do not know, for example, whether well-studied phenomena such as \phase transition", which show up for many NP-complete problems (e.g., sat) happen for p 2-complete problems, and whether they are related to an \easy-hard-easy" pattern or not. The goal of this paper is to show some results of an ongoing experimental analysis that aims to provide reasonable answers to such questions. We analyze the problem of evaluating Quantiied Boolean Formulae, which is the prototypical complete problem for all levels of the Polynomial Hierarchy, the computationally simplest hierarchy of complexity classes above NP of great interest to KR.
منابع مشابه
Providing Better Support for Quanti ed Queries
Relational database systems do not e ectively support complex queries containing quanti ers (quanti ed queries) that are increasingly becoming important in decision support applications. Generalized quanti ers provide an e ective way of expressing such queries naturally. In this paper, we consider the problem of processing quanti ed queries within the generalized quanti er framework. We demonst...
متن کاملAn Algorithm to Evaluate Quanti ed Boolean Formulae
The high computational complexity of advanced reasoning tasks such as belief revision and planning calls for eecient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate , an algorithm for evaluating Quantiied Boolean Formulae, a language that extends propositional logic in a way such that many advanced forms of propo-sitional reasoning, e.g., reasoni...
متن کاملConstant Domain Quanti ed Modal Logics Without Boolean Negation
There is a natural way to add rules for rst-order quanti ers to proof theories for propositional relevant logics, and there is a natural way to add evaluation conditions for quanti ers to the semantics for propositional relevant logics. Kit Fine has shown us that these two natural ways of modelling rst order relevant logics do not match up [6]. Furthermore, Fine has given a semantics for the na...
متن کاملAn Algorithm to Evaluate Quanti ed BooleanFormulae and its Experimental Evaluation
The high computational complexity of advanced reasoning tasks such as reasoning about knowledge and planning calls for eecient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate, an algorithm for evaluating Quantiied Boolean Formulae (QBFs). Algorithms for evaluation of QBFs are suitable for the experimental analysis on problems that belong to a wid...
متن کاملA miniKanren Interactive Proof System for Deciding the Truth of (simple) Quanti ed Boolean Formulae
We present an application of miniKanren with respect to the needs of Proof and Complexity Theories. We implement an Interactive Proof System for deciding the truth of quanti ed boolean formulae, which completes the proof that the complexity classes IP(class of problems solvable by an interactive proof system) and PSPACE(class of decision problems requiring polynomial space, but may need exponen...
متن کامل